Decision Problems for Equational Theories of Relation Algebras

نویسندگان

  • Hajnal Andréka
  • Steven Givant
  • István Németi
چکیده

The foundation of an algebraic theory of binary relations was laid by C. S. Peirce, building on earlier work of Boole and De Morgan. The basic universe of discourse of this theory is a collection of binary relations over some set, and the basic operations on these relations are those of forming unions, complements, relative products (i.e., compositions), and converses (i.e., inverses). There is also a distinguished relation, the identity relation. Other operations and distinguished relations studied by Peirce are definable in terms of the ones just mentioned. Such an algebra of relations is called a set relation algebra. A modern development of this theory as a theory of abstract relation algebras, axiomatized by a finite set of equations, was undertaken by Tarski and his students and colleagues, beginning around 1940. In 1942, Tarski proved that all of classical mathematics could be developed within the framework of the equational theory of relation algebras. Indeed, he created a general method for interpreting into the equational theory of relation algebras first-order theories that are strong enough to form a basis for the development of mathematics, in particular, set theories and number theories. As a consequence, he established that the equational theories of relation algebras and of set relation algebras are undecidable (see [10] and [11], and see [2] or [11], in particular Chapter 8, for unexplained terminology). They were the first known examples of undecidable equational theories. As was pointed out in [11], Tarski’s proof actually shows more. Namely, any class of relation algebras that contains the full set relation algebra on some infinite set (i.e., the set relation algebra whose universe consists of all binary relations on the infinite set) or, equivalently, that contains all set relation algebras on infinite sets must have an undecidable equational theory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dually quasi-De Morgan Stone semi-Heyting algebras II. Regularity

This paper is the second of a two part series. In this Part, we prove, using the description of simples obtained in Part I, that the variety $mathbf{RDQDStSH_1}$ of regular dually quasi-De Morgan Stone semi-Heyting algebras of level 1 is the join of the variety generated by the twenty 3-element $mathbf{RDQDStSH_1}$-chains and the variety of dually quasi-De Morgan Boolean semi-Heyting algebras--...

متن کامل

Dually quasi-De Morgan Stone semi-Heyting algebras I. Regularity

This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended $lor$-De Morgan law introduced in cite{Sa12}. Then, using this result and the results of cite{Sa12}, we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) ...

متن کامل

Weakly associative relation algebras with projections

Built on the foundations laid by Peirce, Schröder and others in the 19th century, the modern development of relation algebras started with the work of Tarski and his colleagues [21, 22]. They showed that relation algebras can capture strong rst-order theories like ZFC, and so their equational theory is undecidable. The less expressive classWA of weakly associative relation algebras were introd...

متن کامل

Uniication in the Union of Disjoint Equational Theories: Combining Decision Procedures Uniication in the Union of Disjoint Equational Theories: Combining Decision Procedures

Most of the work on the combination of uniication algorithms for the union of disjoint equational theories has been restricted to algorithms which compute nite complete sets of uniiers. Thus the developed combination methods usually cannot be used to combine decision procedures, i.e., algorithms which just decide solvability of uniication problems without computing uniiers. In this paper we des...

متن کامل

FUZZY EQUATIONAL CLASSES ARE FUZZY VARIETIES

In the framework of fuzzy algebras with fuzzy equalities and acomplete lattice as a structure of membership values, we investigate fuzzyequational classes. They consist of special fuzzy algebras fullling the samefuzzy identities, dened with respect to fuzzy equalities. We introduce basicnotions and the corresponding operators of universal algebra: construction offuzzy subalgebras, homomorphisms...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007